Graph indexing based on discriminative frequent structure analysis
نویسندگان
چکیده
منابع مشابه
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph search is a key problem, which is defined as given a query Q, retrieving all graphs containing Q as a sub-graph in the graph database. Most existing sub-graph search methods try to filter out false positives (graphs t...
متن کاملDiscriminative graph training for ultra-fast low-footprint speech indexing
We study low complexity models for audio search. The indexing and retrieval system consists of Automatic Speech Recognition (ASR), phone expansion, N -gram indexing and approximate match. In particular, the ASR system can vary tremendously in complexity ranging from a simple speakerindependent system to a fully speaker-adapted system. In this paper, we focus on a speaker-independent system with...
متن کاملl1-Graph Based Music Structure Analysis
An unsupervised approach for automatic music structure analysis is proposed resorting to the following assumption: If the feature vectors extracted from a specific music segment are drawn from a single subspace, then the sequence of feature vectors extracted from a music recording will lie in a union of as many subspaces as the music segments in this recording are. It is well known that each fe...
متن کاملFinding Frequent Subgraphs in a Single Graph based on Symmetry
Mining frequent subgraphs is a basic activity that plays an important role in mining graph data. In this paper an algorithm is proposed to find frequent subgraphs in a single large graph that has applications such as protein interactions, social networks, web interactions. One of the key operations required by any frequent subgraph discovery algorithm is to perform graph isomorphism. The propos...
متن کاملGraph Indexing and Retrieval Based on Median Graphs
Metric indexing is used to organize large databases of Attributed Graphs and define fast queries on these sets. We present a proposal where indexing is based on an m-tree in which routing nodes of the m-tree act as prototypes of the sub-cluster of Attributed Graphs that routing nodes represent. In the classical schemes, the information kept in the tree nodes of the subcluster is a selected Attr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2005
ISSN: 0362-5915,1557-4644
DOI: 10.1145/1114244.1114248